
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

int _findMedianSortedArrays();
int _longestPalindrome();
int _zigzagCovert();
int _ReverseInt();
int _myAtoi();
int _isPalindrome();
int _isMatch();
int _numRabbits();
int _removeElements();
int _triangleNumber();
int _reverseBetween();
int _isPowerOfTwo();
int _maxArea();
int _intToRoman();
int _searchRange();
int _titleToNumber();
int _MinStack();
int _searchInRotatedSortedArray();
int _combinations();
int _maxPoints();
int _ladderLength();
int _removeElement();
int _countAndSay();
int _singleNumber();
int _mergeKLists();
int _numDistinct();
int _searchInRoatedSortedArray2();
int _addBinary();
int _singleNumber2();
int _deleteDuplicates2();
int _romanToInt();

typedef int(*FP_CALL)();
FP_CALL caseArr[] = {
	_romanToInt,
};

void runcase()
{
	FP_CALL fp = nullptr;
	int num = sizeof(caseArr) / sizeof(FP_CALL);
	for (int i = 0; i < num; i++)
	{
		fp = caseArr[i];
		(*fp)();
	}
}
int main()
{	
	cout << endl << "======leetcode test case begin======" << endl;

	//run case
	runcase();

	cout << "======leetcode test case end======" << endl;

	return 0;
}